搜索资源列表
HuffmanCoding
- 用哈夫曼编码实现文件压缩。压缩模块是通过构造哈夫曼树,以文件中字符出现的次数作为权值,得到哈夫曼编码对文件进行压缩。首先扫描文件统计字符出现次数,存入链表中。再将链表中的weight依次赋予权值,然后创建对应的哈夫曼树。最后将生成的哈夫曼树的长度写入文件,再将生成的哈夫曼树写入压缩文件。 解压缩模块是要将压缩文件还原为原文件。先读取一个4字节的哈夫曼树长度,根据读取的长度分配对应大小的哈夫曼树存储空间,然后读取哈夫曼树。-File compression with Huffman Codin
CreateBinTreeRun.java
- 创建二叉树的Java程序,源码,文本存储-Create a binary tree of Java programs, source code, text storage
BTree
- 定义二叉树两个结点的最小距离为这两个结点的最近公共祖先分别到这两个结点的路径长度之和。请设计一种方法,找出给定二叉树中任意两个结点的最小距离,可以考虑以图形显示之。程序实现二叉树的层次遍历,要求每层之间的数据用一个空格分开。二叉树采用二叉链表方式进行存储-Defined binary minimum distance of two nodes for these two nodes were the most recent common ancestor of these two nodes a
a-binary-tree-search-algorithm
- 在对二叉树存储结构进行分析的基础上,介绍二叉树遍历算法的一种应用,即基于求解二叉树深度算法设计实 现的搜索二叉树中最长路径的算法。这里详细介绍了搜索二叉树中最长路径问题的分析解决思路,在对可能的预期结果进 行分析的基础上,给出了算法的设计方案,同时给出了具体的C语言算法描述。-By analyzing the storage structure of binary tree,a kind of application of binary tree traversal algorithm,
37116txt
- 任务: 要求能够输入树的各个结点,并能够输出用不同方法遍历的遍历序列;分别建立建立二叉树存储结构的的输入函数、输出层序遍历序列的函数、输出先序遍历序列的函数; -Whereas it is essential, if man is not to be compelled to have recourse, as a last resort, to rebellion against tyranny and oppression, that human rights should b
Using-binary-tree
- 数据结构课程设计 利用二叉树存储表达式,并求值,返回-Curriculum design using the binary tree data structure stored in the expression and evaluation, return
binarytree
- 用二叉链表作为二叉树存储表示编写递归算法。设计思路及调试结果在上机报告内。程序文件在附件中,需包含头文件。-List as a binary tree with binary memory, said write recursive algorithms. Design ideas and results on the machine commissioning report. Program files in the attachment, the need to include the he
Binary-tree
- 建立二叉树存储结构,求二叉树的前序中序后序遍历,以及求指定节点的路径-The establishment of binary storage structure, seeking pre-order binary tree traversal in order after the order, and find the path specified node
RFID
- 一种RFID识别算法的模拟,模拟了采用多叉树存储的数据如何快速查找的过程,可以在VC++下运行。-An RFID identification algorithm simulation, simulation of a multi-tree storage of data is how to quickly find the process can run VC++ under.
B-tree
- B树的维护、查询及图形仿真 设计与实现B-树存储结构,以及B-树构造、插入、删除、查找等操作,并以图形方式模拟这一动态过程。-The maintenance of the B-tree, inquiries and graphic simulation design and realization of a B-tree storage structure, as well as the B-tree structure, insert, delete, search operation, a
binary-tree
- 1.掌握二叉树的概念和性质 2. 掌握完全二叉树存储结构。 3.掌握完全二叉树的基本操作 4.创建完全二叉树(用字母表示节点)(用顺序方式存储) 5.求二叉树的深度和叶子结点数 6.实现二叉树的前序、中序、后序和层次遍历。 7.查找给定结点的双亲、祖先和左右孩子节点。 -1. Grasp the concept and nature of the binary tree master the complete binary tree storage stru
erchashukuohaope
- 用二叉树存储结构去实现括号匹配,其中的算法非常精炼-Binary Tree matching brackets
实现一个用顺序存储实现的二叉树类
- 本次程序设计是为了实现一个用顺序存储实现的二叉树类。-The program is designed to achieve a sequential storage implementation using a binary tree class.
Bny2
- 基于目录树存储的二叉树模板类定义,基础类,派生类-Binary-tree base define
my_algorithm
- 建立t树存储数据,录入数据为文件形式,每个数字占据一行,这样可以实现建立t树-T build tree to store data, input data for the document, each digit occupies one line, so you can achieve the establishment of tree t
word
- 单词精灵程序 可以二叉树存储数据 同时具有查询数据与解释的功能-Word Wizard program can store data in a binary tree also has the function of query data and interpretation
ufstmaps
- 一个利用二叉树存储和查找数据的类,利用二叉树存储结构,实现建立、查找、新增、删除等功能。-Find a class storage and use of binary data, use binary storage structure, to achieve the establishment, search, add, delete functions.
search-tree
- 建立二叉树,层序、先序遍历 要求能够输入树的各个结点,并能够输出用不同方法遍历的遍历序列;分别建立建立二叉树存储结构的的输入函数、输出层序遍历序列的函数、输出先序遍历序列的函数;-Establishment of a binary tree, sequence, preorder required to enter each node of the tree, and can output traversal sequences of different methods to traverse
haffuman-for-students-imformation
- 数据结构内容,使用哈夫曼树存储学生信息,适用于VC 和C-Data structure of the content, use the Huffman tree to store student information for VC and C++
binary-storage-tree
- 对二叉树存储的知识进行功能实现,能更好的帮助理解二叉树的存储结构。-Knowledge of binary storage functions to achieve, to better help understand the structure of the binary tree is stored.